<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Navo Portable Library: navo/algorithm/nonlinear/binary/treaplnk.c源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- 制作者 Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Navo Portable Library&#160;<span id="projectnumber">Ver 1.0.20120827</span></div>
   <div id="projectbrief">Provides generic platform independent facilities.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="annotated.html"><span>数据结构</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
      <li><a href="globals.html"><span>全局定义</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<h1>navo/algorithm/nonlinear/binary/treaplnk.c</h1>  </div>
</div>
<div class="contents">
<a href="treaplnk_8c.html">浏览该文件的文档。</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */</span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &quot;<a class="code" href="treaplnk_8h.html" title="Linked treap.">treaplnk.h</a>&quot;</span>
<a name="l00012"></a>00012 
<a name="l00013"></a>00013 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#pragma optimize(&quot;t&quot;, on)</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span><span class="preprocessor">#endif  </span><span class="comment">/* #ifdef _MSC_VER */</span>
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {
<a name="l00019"></a>00019 <span class="preprocessor">#endif </span><span class="comment">/* #ifdef __cplusplus */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="keyword">static</span> <span class="keyword">inline</span> treaplnk_link_left(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> child)
<a name="l00022"></a>00022 {
<a name="l00023"></a>00023     parent-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a> = child;
<a name="l00024"></a>00024     <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga603045fe815f3b650f3086b3747bb6a9" title="仅在node不为空时，设置node的父节点">treaplnk_set_parent_if</a>(child, parent);
<a name="l00025"></a>00025 }
<a name="l00026"></a>00026 
<a name="l00027"></a>00027 <span class="keyword">static</span> <span class="keyword">inline</span> treaplnk_link_right(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> child)
<a name="l00028"></a>00028 {
<a name="l00029"></a>00029     parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a> = child;
<a name="l00030"></a>00030     <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga603045fe815f3b650f3086b3747bb6a9" title="仅在node不为空时，设置node的父节点">treaplnk_set_parent_if</a>(child, parent);
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">static</span> <span class="keyword">inline</span> treaplnk_link_left_unsafe(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent, 
<a name="l00034"></a>00034                                         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> child)
<a name="l00035"></a>00035 {
<a name="l00036"></a>00036     parent-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a> = child;
<a name="l00037"></a>00037     child-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a> = parent;
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="keyword">static</span> <span class="keyword">inline</span> treaplnk_link_right_unsafe(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent, 
<a name="l00041"></a>00041                                          <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> child)
<a name="l00042"></a>00042 {
<a name="l00043"></a>00043     parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a> = child;
<a name="l00044"></a>00044     child-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a> = parent;
<a name="l00045"></a>00045 }
<a name="l00046"></a>00046 
<a name="l00047"></a>00047 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> treaplnk_replace_child(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, 
<a name="l00048"></a>00048     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> me, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> old_child, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> new_child)
<a name="l00049"></a>00049 {
<a name="l00050"></a>00050     <span class="keywordflow">if</span> (me) {
<a name="l00051"></a>00051         <span class="keywordflow">if</span> (old_child == me-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00052"></a>00052             me-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a> = new_child;
<a name="l00053"></a>00053         <span class="keywordflow">else</span>
<a name="l00054"></a>00054             me-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a> = new_child;
<a name="l00055"></a>00055     } <span class="keywordflow">else</span>
<a name="l00056"></a>00056         root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a> = new_child;
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058 
<a name="l00059"></a>00059 <span class="comment">/* 对top节点进行左旋转 */</span>
<a name="l00060"></a>00060 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> treaplnk_rotate_left(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* top, 
<a name="l00061"></a>00061                                         <a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* parent = top-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a>;
<a name="l00064"></a>00064     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* node = top-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00065"></a>00065     treaplnk_link_right(top, node-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>);
<a name="l00066"></a>00066     treaplnk_link_left_unsafe(node, top);
<a name="l00067"></a>00067     treaplnk_replace_child(root, parent, top, node);
<a name="l00068"></a>00068     node-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a> = parent;
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070 
<a name="l00071"></a>00071 <span class="comment">/* 对top节点进行右旋转 */</span>
<a name="l00072"></a>00072 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> treaplnk_rotate_right(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* top, 
<a name="l00073"></a>00073                                          <a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* parent = top-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a>;
<a name="l00076"></a>00076     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* node = top-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00077"></a>00077     treaplnk_link_left(top, node-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>);
<a name="l00078"></a>00078     treaplnk_link_right_unsafe(node, top);
<a name="l00079"></a>00079     treaplnk_replace_child(root, parent, top, node);
<a name="l00080"></a>00080     node-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a> = parent;
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082 
<a name="l00083"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaae88f9f0194b5721af46c65d5dea2078">00083</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaae88f9f0194b5721af46c65d5dea2078" title="修正树">treaplnk_fix</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* node, 
<a name="l00084"></a>00084                             <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* parent)
<a name="l00085"></a>00085 {
<a name="l00086"></a>00086     <span class="keywordflow">while</span> (parent &amp;&amp; parent-&gt;<a class="code" href="struct____treaplnk__node.html#a12a507bc765598b5db4100af52f045e3" title="优先权">priority</a> &gt; node-&gt;<a class="code" href="struct____treaplnk__node.html#a12a507bc765598b5db4100af52f045e3" title="优先权">priority</a>) {
<a name="l00087"></a>00087         <span class="keywordflow">if</span> (node == parent-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00088"></a>00088             treaplnk_rotate_right(parent, root);
<a name="l00089"></a>00089             parent = node-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a>;
<a name="l00090"></a>00090         } <span class="keywordflow">else</span> {
<a name="l00091"></a>00091             treaplnk_rotate_left(parent, root);
<a name="l00092"></a>00092             parent = node-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a>;
<a name="l00093"></a>00093         }
<a name="l00094"></a>00094     }
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096 
<a name="l00097"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafdefc8690af7387b1f376247e69b9ad7">00097</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafdefc8690af7387b1f376247e69b9ad7" title="移除某个节点">treaplnk_erase</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* entry)
<a name="l00098"></a>00098 {
<a name="l00099"></a>00099     <span class="keywordflow">do</span> {
<a name="l00100"></a>00100         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* child;
<a name="l00101"></a>00101         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* parent;
<a name="l00102"></a>00102         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* left = entry-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00103"></a>00103         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_node</a>* right = entry-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00104"></a>00104         <span class="comment">/* 如果entry节点最多只有一个孩子，则直接删除entry节点</span>
<a name="l00105"></a>00105 <span class="comment">         * 并调整树，如果entry同时有两个孩子，需要将其转换成</span>
<a name="l00106"></a>00106 <span class="comment">         * 只有一子或无子的情况</span>
<a name="l00107"></a>00107 <span class="comment">         */</span>
<a name="l00108"></a>00108         <span class="keywordflow">if</span> (!left)
<a name="l00109"></a>00109             child = right;
<a name="l00110"></a>00110         <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!right)
<a name="l00111"></a>00111             child = left;
<a name="l00112"></a>00112         <span class="keywordflow">else</span> {
<a name="l00113"></a>00113             <span class="comment">/* 此时，entry节点有两个子节点，如果左子节点的修正值</span>
<a name="l00114"></a>00114 <span class="comment">             * 小于右子节点的修正值，则右旋entry节点，如果左子节</span>
<a name="l00115"></a>00115 <span class="comment">             * 点的修正值大于右子节点的修正值，则左旋entry节点</span>
<a name="l00116"></a>00116 <span class="comment">             */</span>
<a name="l00117"></a>00117             <span class="keywordflow">if</span> (left-&gt;<a class="code" href="struct____treaplnk__node.html#a12a507bc765598b5db4100af52f045e3" title="优先权">priority</a> &lt; right-&gt;<a class="code" href="struct____treaplnk__node.html#a12a507bc765598b5db4100af52f045e3" title="优先权">priority</a>)
<a name="l00118"></a>00118                 treaplnk_rotate_right(entry, root);
<a name="l00119"></a>00119             <span class="keywordflow">else</span>
<a name="l00120"></a>00120                 treaplnk_rotate_left(entry, root);
<a name="l00121"></a>00121             <span class="keywordflow">continue</span>;
<a name="l00122"></a>00122         }
<a name="l00123"></a>00123         <span class="comment">/* 接上面的if和else if，删除entry节点 */</span>
<a name="l00124"></a>00124         parent = entry-&gt;<a class="code" href="struct____treaplnk__node.html#a36269bd557d652bbb20aba4f5648dc6d" title="父节点">parent</a>;
<a name="l00125"></a>00125         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga603045fe815f3b650f3086b3747bb6a9" title="仅在node不为空时，设置node的父节点">treaplnk_set_parent_if</a>(child, parent);
<a name="l00126"></a>00126         treaplnk_replace_child(root, parent, entry, child);
<a name="l00127"></a>00127     } <span class="keywordflow">while</span> (0);
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129 
<a name="l00130"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga0157ffea5e9b1a9d9bd903d8c6a518d8">00130</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga0157ffea5e9b1a9d9bd903d8c6a518d8" title="移除区域内的节点">treaplnk_erases</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> begin, 
<a name="l00131"></a>00131                                 <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> end, <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga12473c60d17919848883f04bfa09a5a5" title="单参数回调函数指针">treaplnk_pr1</a> erase_handler)
<a name="l00132"></a>00132 {
<a name="l00133"></a>00133     <span class="keywordflow">if</span> (erase_handler) {
<a name="l00134"></a>00134         <span class="keywordflow">while</span> (begin != end) {
<a name="l00135"></a>00135             <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur = begin;
<a name="l00136"></a>00136             <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(begin);
<a name="l00137"></a>00137             <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafdefc8690af7387b1f376247e69b9ad7" title="移除某个节点">treaplnk_erase</a>(root, cur);
<a name="l00138"></a>00138             erase_handler(cur);
<a name="l00139"></a>00139         }
<a name="l00140"></a>00140 
<a name="l00141"></a>00141     } <span class="keywordflow">else</span> {
<a name="l00142"></a>00142         <span class="keywordflow">while</span> (begin != end)
<a name="l00143"></a>00143             <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafdefc8690af7387b1f376247e69b9ad7" title="移除某个节点">treaplnk_erase</a>(root, <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaa17763173a4fb80564079a86cc9f7eca" title="迭代器后自增">treaplnk_inc_later</a>(begin));
<a name="l00144"></a>00144     }
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 
<a name="l00147"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga71d356704e6ae0fd1b686ac10fce28eb">00147</a> NV_IMPL <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga71d356704e6ae0fd1b686ac10fce28eb" title="给迭代器增加一段距离或减小一段距离">treaplnk_advance</a>(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur, <span class="keywordtype">int</span> dist)
<a name="l00148"></a>00148 {
<a name="l00149"></a>00149     <span class="keywordflow">if</span> (dist &gt; 0) {
<a name="l00150"></a>00150         <span class="keywordflow">while</span> (cur &amp;&amp; dist--)
<a name="l00151"></a>00151             <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(cur);
<a name="l00152"></a>00152     } <span class="keywordflow">else</span> {
<a name="l00153"></a>00153         <span class="keywordflow">while</span> (cur &amp;&amp; dist++)
<a name="l00154"></a>00154             <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga49e38700e1a751927091febf09c6f1dc" title="迭代器递减">treaplnk_dec</a>(cur);
<a name="l00155"></a>00155     }
<a name="l00156"></a>00156     <span class="keywordflow">return</span> cur;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 
<a name="l00159"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4cb4d2e7f6c2518f504eaee046450c4c">00159</a> NV_IMPL <span class="keywordtype">int</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4cb4d2e7f6c2518f504eaee046450c4c" title="判断一个节点是否存在于树中">treaplnk_exist</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> itr)
<a name="l00160"></a>00160 {
<a name="l00161"></a>00161     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga912adb278fdbb3938e29e0bcf2f58c6e" title="得到树的最左端节点">treaplnk_front</a>(root);
<a name="l00162"></a>00162     
<a name="l00163"></a>00163     <span class="keywordflow">while</span> (i) {
<a name="l00164"></a>00164         <span class="keywordflow">if</span> (i == itr)
<a name="l00165"></a>00165             <span class="keywordflow">return</span> 1;
<a name="l00166"></a>00166         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(i);
<a name="l00167"></a>00167     }
<a name="l00168"></a>00168     
<a name="l00169"></a>00169     <span class="keywordflow">return</span> 0;
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171 
<a name="l00172"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga912adb278fdbb3938e29e0bcf2f58c6e">00172</a> NV_IMPL <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga912adb278fdbb3938e29e0bcf2f58c6e" title="得到树的最左端节点">treaplnk_front</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a>;
<a name="l00175"></a>00175 
<a name="l00176"></a>00176     <span class="keywordflow">if</span> (!i)
<a name="l00177"></a>00177         <span class="keywordflow">return</span> NULL;
<a name="l00178"></a>00178 
<a name="l00179"></a>00179     <span class="comment">/* 一直往左边走，找到最左边的节点 */</span>
<a name="l00180"></a>00180     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00181"></a>00181         i = i-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00182"></a>00182 
<a name="l00183"></a>00183     <span class="keywordflow">return</span> i;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 
<a name="l00186"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2215902aa2d70496fccdb14fcf8da0ce">00186</a> NV_IMPL <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2215902aa2d70496fccdb14fcf8da0ce" title="得到树的最右端节点">treaplnk_back</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00187"></a>00187 {
<a name="l00188"></a>00188     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a>;
<a name="l00189"></a>00189     
<a name="l00190"></a>00190     <span class="keywordflow">if</span> (!i)
<a name="l00191"></a>00191         <span class="keywordflow">return</span> NULL;
<a name="l00192"></a>00192     
<a name="l00193"></a>00193     <span class="comment">/* 一直往右边走，找到最右边的节点 */</span>
<a name="l00194"></a>00194     <span class="keywordflow">while</span> (i-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>)
<a name="l00195"></a>00195         i = i-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00196"></a>00196     
<a name="l00197"></a>00197     <span class="keywordflow">return</span> i;
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199 
<a name="l00200"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4ef2c4a4f07589b1dae6b47c09ce790a">00200</a> NV_IMPL <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4ef2c4a4f07589b1dae6b47c09ce790a" title="得到当前节点的中序后继节点">treaplnk_next</a>(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur)
<a name="l00201"></a>00201 {
<a name="l00202"></a>00202     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent;
<a name="l00203"></a>00203     
<a name="l00204"></a>00204     <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00205"></a>00205     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00206"></a>00206         cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00207"></a>00207         <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00208"></a>00208         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00209"></a>00209             cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00210"></a>00210         <span class="keywordflow">return</span> cur;
<a name="l00211"></a>00211     }
<a name="l00212"></a>00212     <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00213"></a>00213     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafd4f501b5392c966d7f7ccb6253ec465" title="得到父节点">treaplnk_parent</a>(cur)) 
<a name="l00214"></a>00214             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>)
<a name="l00215"></a>00215         cur = parent;
<a name="l00216"></a>00216     
<a name="l00217"></a>00217     <span class="keywordflow">return</span> parent;
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219 
<a name="l00220"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gacdde57d39d567fc2b5dbc661f67bef08">00220</a> NV_IMPL <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gacdde57d39d567fc2b5dbc661f67bef08" title="得到当前节点的中序前驱节点">treaplnk_prev</a>(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur)
<a name="l00221"></a>00221 {
<a name="l00222"></a>00222     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent;
<a name="l00223"></a>00223 
<a name="l00224"></a>00224     <span class="comment">/* 如果有左孩子，往左边走 */</span>
<a name="l00225"></a>00225     <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00226"></a>00226         cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00227"></a>00227         <span class="comment">/* 找左孩子下最靠右的节点 */</span>
<a name="l00228"></a>00228         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>)
<a name="l00229"></a>00229             cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00230"></a>00230         <span class="keywordflow">return</span> cur;
<a name="l00231"></a>00231     }
<a name="l00232"></a>00232     <span class="comment">/* 如果没有左孩子，向父节点走 */</span>
<a name="l00233"></a>00233     <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafd4f501b5392c966d7f7ccb6253ec465" title="得到父节点">treaplnk_parent</a>(cur)) 
<a name="l00234"></a>00234             &amp;&amp; cur == parent-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00235"></a>00235         cur = parent;
<a name="l00236"></a>00236 
<a name="l00237"></a>00237     <span class="keywordflow">return</span> parent;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 
<a name="l00240"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga69bd6cd659eb01cee33b211cc5883fab">00240</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga69bd6cd659eb01cee33b211cc5883fab" title="计算树的深度">treaplnk_depth</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00241"></a>00241 {
<a name="l00242"></a>00242     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00243"></a>00243     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00244"></a>00244     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent;
<a name="l00245"></a>00245     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur = root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a>;
<a name="l00246"></a>00246     
<a name="l00247"></a>00247     <span class="keywordflow">if</span> (cur) {
<a name="l00248"></a>00248         cur_depth = 1;
<a name="l00249"></a>00249         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00250"></a>00250             cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00251"></a>00251             ++cur_depth;
<a name="l00252"></a>00252         }
<a name="l00253"></a>00253         max_depth = cur_depth;
<a name="l00254"></a>00254         <span class="keywordflow">do</span> {<span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00255"></a>00255             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00256"></a>00256                 cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00257"></a>00257                 ++cur_depth;
<a name="l00258"></a>00258                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00259"></a>00259                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00260"></a>00260                     cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00261"></a>00261                     ++cur_depth;
<a name="l00262"></a>00262                 }
<a name="l00263"></a>00263                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00264"></a>00264                     max_depth = cur_depth;
<a name="l00265"></a>00265             } <span class="keywordflow">else</span> {
<a name="l00266"></a>00266                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00267"></a>00267                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafd4f501b5392c966d7f7ccb6253ec465" title="得到父节点">treaplnk_parent</a>(cur)) 
<a name="l00268"></a>00268                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00269"></a>00269                     cur = parent;
<a name="l00270"></a>00270                     --cur_depth;
<a name="l00271"></a>00271                 }
<a name="l00272"></a>00272                 cur = parent;
<a name="l00273"></a>00273                 --cur_depth;
<a name="l00274"></a>00274             }
<a name="l00275"></a>00275         } <span class="keywordflow">while</span> (cur);
<a name="l00276"></a>00276     }
<a name="l00277"></a>00277     
<a name="l00278"></a>00278     <span class="keywordflow">return</span> max_depth;
<a name="l00279"></a>00279 }
<a name="l00280"></a>00280 
<a name="l00281"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga0e528fc27a6476cf7cac10305a4bc191">00281</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga0e528fc27a6476cf7cac10305a4bc191" title="计算树的叶子数">treaplnk_leafs</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00282"></a>00282 {
<a name="l00283"></a>00283     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00284"></a>00284     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent;
<a name="l00285"></a>00285     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaf5df84d890ae7dc07c210fead0d826ec" title="得到指向正向起始位置的迭代器">treaplnk_begin</a>(root);
<a name="l00286"></a>00286     
<a name="l00287"></a>00287     <span class="keywordflow">while</span> (cur) {
<a name="l00288"></a>00288         <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00289"></a>00289         <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00290"></a>00290             cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00291"></a>00291             <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00292"></a>00292             <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00293"></a>00293                 cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00294"></a>00294         } <span class="keywordflow">else</span> {
<a name="l00295"></a>00295             <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00296"></a>00296                 ++leafs;
<a name="l00297"></a>00297             <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00298"></a>00298             <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafd4f501b5392c966d7f7ccb6253ec465" title="得到父节点">treaplnk_parent</a>(cur)) 
<a name="l00299"></a>00299                     &amp;&amp; cur == parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>)
<a name="l00300"></a>00300                 cur = parent;
<a name="l00301"></a>00301             cur = parent;
<a name="l00302"></a>00302         }
<a name="l00303"></a>00303     }
<a name="l00304"></a>00304     
<a name="l00305"></a>00305     <span class="keywordflow">return</span> leafs;
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307 
<a name="l00308"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gac1c3d37dd05e4d469eff62eebc4bb483">00308</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gac1c3d37dd05e4d469eff62eebc4bb483" title="获取树的信息，包括节点数、深度、叶子数">treaplnk_get_info</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="structtreaplnk__info.html" title="树信息表">treaplnk_info</a>* info)
<a name="l00309"></a>00309 {
<a name="l00310"></a>00310     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00311"></a>00311     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00312"></a>00312     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00313"></a>00313     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00314"></a>00314     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> parent;
<a name="l00315"></a>00315     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur = root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a>;
<a name="l00316"></a>00316     
<a name="l00317"></a>00317     <span class="keywordflow">if</span> (cur) {
<a name="l00318"></a>00318         cur_depth = 1;
<a name="l00319"></a>00319         <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00320"></a>00320             cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00321"></a>00321             ++cur_depth;
<a name="l00322"></a>00322         }
<a name="l00323"></a>00323         max_depth = cur_depth;
<a name="l00324"></a>00324         <span class="keywordflow">do</span> {
<a name="l00325"></a>00325             ++cnt;
<a name="l00326"></a>00326             <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00327"></a>00327             <span class="keywordflow">if</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00328"></a>00328                 cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>;
<a name="l00329"></a>00329                 ++cur_depth;
<a name="l00330"></a>00330                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00331"></a>00331                 <span class="keywordflow">while</span> (cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>) {
<a name="l00332"></a>00332                     cur = cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>;
<a name="l00333"></a>00333                     ++cur_depth;
<a name="l00334"></a>00334                 }
<a name="l00335"></a>00335                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00336"></a>00336                     max_depth = cur_depth;
<a name="l00337"></a>00337             } <span class="keywordflow">else</span> {
<a name="l00338"></a>00338                 <span class="keywordflow">if</span> (!cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>)
<a name="l00339"></a>00339                     ++leafs;
<a name="l00340"></a>00340                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00341"></a>00341                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gafd4f501b5392c966d7f7ccb6253ec465" title="得到父节点">treaplnk_parent</a>(cur)) 
<a name="l00342"></a>00342                         &amp;&amp; cur == parent-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>) {
<a name="l00343"></a>00343                     cur = parent;
<a name="l00344"></a>00344                     --cur_depth;
<a name="l00345"></a>00345                 }
<a name="l00346"></a>00346                 cur = parent;
<a name="l00347"></a>00347                 --cur_depth;
<a name="l00348"></a>00348             }
<a name="l00349"></a>00349         } <span class="keywordflow">while</span> (cur);
<a name="l00350"></a>00350     }
<a name="l00351"></a>00351     
<a name="l00352"></a>00352     info-&gt;<a class="code" href="structtreaplnk__info.html#a76d971a3c552bc58ba9f0d5fceae9806" title="节点数">count</a> = cnt;
<a name="l00353"></a>00353     info-&gt;<a class="code" href="structtreaplnk__info.html#a820c167ceaaa9759b0ca2695d22db55c" title="深度">depth</a> = max_depth;
<a name="l00354"></a>00354     info-&gt;<a class="code" href="structtreaplnk__info.html#a62f3b2ad4f6c6147d1bb9a71dd8c9656" title="叶子数">leafs</a> = leafs;
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356 
<a name="l00357"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gad66cce0995090f8ff4e255e45d83e927">00357</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gad66cce0995090f8ff4e255e45d83e927" title="获取树的节点总数">treaplnk_count</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root)
<a name="l00358"></a>00358 {
<a name="l00359"></a>00359     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00360"></a>00360     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaf5df84d890ae7dc07c210fead0d826ec" title="得到指向正向起始位置的迭代器">treaplnk_begin</a>(root);
<a name="l00361"></a>00361 
<a name="l00362"></a>00362     <span class="keywordflow">while</span> (i) {
<a name="l00363"></a>00363         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(i);
<a name="l00364"></a>00364         ++cnt;
<a name="l00365"></a>00365     }
<a name="l00366"></a>00366 
<a name="l00367"></a>00367     <span class="keywordflow">return</span> cnt;
<a name="l00368"></a>00368 }
<a name="l00369"></a>00369 
<a name="l00370"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4dbe3b5512bf8d6407cef0ff821d316c">00370</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4dbe3b5512bf8d6407cef0ff821d316c" title="计算两个节点的迭代距离">treaplnk_distance</a>(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> first, 
<a name="l00371"></a>00371                          <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> last)
<a name="l00372"></a>00372 {
<a name="l00373"></a>00373     <span class="keywordtype">size_t</span> dist = 1;
<a name="l00374"></a>00374     
<a name="l00375"></a>00375     <span class="keywordflow">while</span> (first != last) {
<a name="l00376"></a>00376         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(first);
<a name="l00377"></a>00377         ++dist;
<a name="l00378"></a>00378     }
<a name="l00379"></a>00379     
<a name="l00380"></a>00380     <span class="keywordflow">return</span> dist;
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382 
<a name="l00383"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga45104dc4d6a3c99f0ca6adb26a1ba60b">00383</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga45104dc4d6a3c99f0ca6adb26a1ba60b" title="计算迭代器的正向索引">treaplnk_index_of</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> itr)
<a name="l00384"></a>00384 {
<a name="l00385"></a>00385     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00386"></a>00386     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaf5df84d890ae7dc07c210fead0d826ec" title="得到指向正向起始位置的迭代器">treaplnk_begin</a>(root);
<a name="l00387"></a>00387     
<a name="l00388"></a>00388     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00389"></a>00389         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(i);
<a name="l00390"></a>00390         ++cnt;
<a name="l00391"></a>00391     }
<a name="l00392"></a>00392     
<a name="l00393"></a>00393     <span class="keywordflow">return</span> cnt;
<a name="l00394"></a>00394 }
<a name="l00395"></a>00395 
<a name="l00396"></a><a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gae3d748d30e5da2583bb3bc3b12ca68db">00396</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gae3d748d30e5da2583bb3bc3b12ca68db" title="计算迭代器的逆向索引">treaplnk_reverse_index_of</a>(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> itr)
<a name="l00397"></a>00397 {
<a name="l00398"></a>00398     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00399"></a>00399     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaaf3b3ffd977431ffbe9d7e24ee09e9e9" title="得到指向逆向起始位置的迭代器">treaplnk_rbegin</a>(root);
<a name="l00400"></a>00400     
<a name="l00401"></a>00401     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00402"></a>00402         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga49e38700e1a751927091febf09c6f1dc" title="迭代器递减">treaplnk_dec</a>(i);
<a name="l00403"></a>00403         ++cnt;
<a name="l00404"></a>00404     }
<a name="l00405"></a>00405     
<a name="l00406"></a>00406     <span class="keywordflow">return</span> cnt;
<a name="l00407"></a>00407 }
<a name="l00408"></a>00408 
<a name="l00409"></a>00409 NV_IMPL <span class="keywordtype">void</span> __do_treaplnk_recurse_foreach(<a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur, 
<a name="l00410"></a>00410                                     <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00411"></a>00411 {
<a name="l00412"></a>00412     <span class="keywordflow">if</span> (cur) {
<a name="l00413"></a>00413         __do_treaplnk_recurse_foreach(cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>, fn, offset);
<a name="l00414"></a>00414         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00415"></a>00415         __do_treaplnk_recurse_foreach(cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>, fn, offset);
<a name="l00416"></a>00416     }
<a name="l00417"></a>00417 }
<a name="l00418"></a>00418 
<a name="l00419"></a>00419 NV_IMPL <span class="keywordtype">void</span> __do_treaplnk_recurse_reverse_foreach(
<a name="l00420"></a>00420                         <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> cur, <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00421"></a>00421 {
<a name="l00422"></a>00422     <span class="keywordflow">if</span> (cur) {
<a name="l00423"></a>00423         __do_treaplnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>, fn, offset);
<a name="l00424"></a>00424         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00425"></a>00425         __do_treaplnk_recurse_reverse_foreach(cur-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a>, fn, offset);
<a name="l00426"></a>00426     }
<a name="l00427"></a>00427 }
<a name="l00428"></a>00428 
<a name="l00429"></a>00429 NV_IMPL <span class="keywordtype">void</span> __treaplnk_serialize(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, 
<a name="l00430"></a>00430                                     <span class="keywordtype">void</span>** buf, <span class="keywordtype">size_t</span> offset)
<a name="l00431"></a>00431 {
<a name="l00432"></a>00432     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> i = <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaf5df84d890ae7dc07c210fead0d826ec" title="得到指向正向起始位置的迭代器">treaplnk_begin</a>(root);
<a name="l00433"></a>00433 
<a name="l00434"></a>00434     <span class="keywordflow">while</span> (i) {
<a name="l00435"></a>00435         <span class="keywordtype">void</span>* p = ((<span class="keywordtype">char</span>*)i) - offset;
<a name="l00436"></a>00436         *buf++ = p;
<a name="l00437"></a>00437         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga2b8d6bb9789641ed54d971da2f4d7976" title="迭代器递增">treaplnk_inc</a>(i);
<a name="l00438"></a>00438     }
<a name="l00439"></a>00439 }
<a name="l00440"></a>00440 
<a name="l00441"></a>00441 NV_IMPL <span class="keywordtype">void</span> __treaplnk_deserialize(<a class="code" href="structtreaplnk__root.html" title="树根">treaplnk_root</a>* root, <span class="keywordtype">char</span>** buf, 
<a name="l00442"></a>00442                                         <span class="keywordtype">size_t</span> cnt, <span class="keywordtype">size_t</span> offset)
<a name="l00443"></a>00443 {
<a name="l00444"></a>00444     <span class="keywordtype">size_t</span> i;
<a name="l00445"></a>00445     <a class="code" href="struct____treaplnk__node.html" title="树堆节点">treaplnk_iter</a> p, q;
<a name="l00446"></a>00446 
<a name="l00447"></a>00447     root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a> = NULL;
<a name="l00448"></a>00448     p = (<a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4b4308fba0d58f5079b69ba269bacb01" title="迭代器">treaplnk_iter</a>)(buf[0] + offset);
<a name="l00449"></a>00449     q = p;
<a name="l00450"></a>00450     p-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a> = NULL;
<a name="l00451"></a>00451     p-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a> = NULL;
<a name="l00452"></a>00452     <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga33f96e3db43b13c620d9ecf47be03418" title="链接两个节点">treaplnk_link</a>(p, NULL, &amp;root-&gt;<a class="code" href="structtreaplnk__root.html#a0c7711a1496b39126279c2b9285a24ed" title="根节点">node</a>);
<a name="l00453"></a>00453     <span class="keywordflow">for</span> (i = 1; i &lt; cnt; ++i) {
<a name="l00454"></a>00454         p = (<a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga4b4308fba0d58f5079b69ba269bacb01" title="迭代器">treaplnk_iter</a>)(buf[i] + offset);
<a name="l00455"></a>00455         p-&gt;<a class="code" href="struct____treaplnk__node.html#aaabd7a688dedb620c93809d069cb5906" title="左子节点">left</a> = NULL;
<a name="l00456"></a>00456         p-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a> = NULL;
<a name="l00457"></a>00457         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#ga33f96e3db43b13c620d9ecf47be03418" title="链接两个节点">treaplnk_link</a>(p, q, &amp;q-&gt;<a class="code" href="struct____treaplnk__node.html#a1878af8228914890446ad2f0cebcf10c" title="右子节点">right</a>);
<a name="l00458"></a>00458         <a class="code" href="group___xE6_xA0_x91_xE5_xA0_x86.html#gaae88f9f0194b5721af46c65d5dea2078" title="修正树">treaplnk_fix</a>(root, p, q);
<a name="l00459"></a>00459         q = p;
<a name="l00460"></a>00460     }
<a name="l00461"></a>00461 }
<a name="l00462"></a>00462 
<a name="l00463"></a>00463 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00464"></a>00464 <span class="preprocessor"></span>}
<a name="l00465"></a>00465 <span class="preprocessor">#endif  </span><span class="comment">/* #ifdef __cplusplus */</span>
</pre></div></div>
</div>
<!--- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>全部</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>数据结构</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>文件</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>函数</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>变量</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>类型定义</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>宏定义</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<hr class="footer"/><address class="footer"><small>Generated at 2015年七月16日 星期四 12:00:37 for Navo Portable Library by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
